package mid;

public class a421_数组中两个数的最大异或值 {
    public static int findMaximumXOR(int[] nums) {
        int max = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            for (int j = i; j < nums.length; j++) {
                if (max <= (nums[i] ^ nums[j])) {
                    max = nums[i] ^ nums[j];
                }
            }
        }
        return max;
    }



}
